Coverage optimization algorithm based on VF-CS in mobile sensor network

A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures.     

基于光流法的固体内部声传播方向测量

目前采用光弹设备测量超声传播方向多为人眼主观观测,其误差较大,难以实现精确的定量测量。将Farneback光流法应用于光弹图像的处理,并根据帧与帧之间的光流图来计算光弹图像中的超声传播方向,可以捕捉图像中的动态声场。在实验中对不同传播方向的超声进行了测量,其绝对偏差度数最大值为2.85°,测量结果较为准确。因此,Farneback光流法可用于光弹图像中声波传播方向的判断,且具有快速、准确和直观等特点。     

新型树启发式搜索算法的机器人路径规划

面对三维空间移动机器人从起始点到终止点的最短路径问题,提出一种新型的边缘点树启发式搜索(TreeEP)算法,该方法将地图空间进行密度可调的三维离散化处理,根据障碍安全距离筛选出障碍物的可靠边缘点信息,再利用树扩散架构选出最能引导搜索方向的潜力点进行扩散搜索,最终得出最短路径。提出局部调整策略,得到改进的Tree-EP算法。实验结果表明,在带障碍复杂地形最短路径搜索应用中,提出的Tree-EP算法与已有方法相比,能找到更短的移动路径。     

基于混合蚁群算法的异质车队低碳VRP研究

针对货运车辆在配送调度过程中产生大量碳排放的问题，建立模型将多种影响碳排放量的因素协同优化。模型中考虑了不同载重量的异质车队，两个节点之间有多条道路的柔性路径，以及车辆重量随卸货而减少的动态负载等因素，以碳排放量、行驶时间和行驶路程为优化目标，并加入了节点需求时间窗、根据速度变化划分路段、交接和卸货时间的约束。提出了一种混合蚁群算法，利用蚁群算法信息素强度更新方式保持群体记忆性，利用粒子群算法的快速收敛特性增加计算效率。通过随机数值算例的仿真优化与对比分析，验证了算法和模型的有效性。     

基于LBT-SA的LoRaWAN信道接入方法研究

标准LoRaWAN协议中定义的纯ALOHA信道接入方法在网络负载较大时会造成大量碰撞，使LoRa网络的可扩展性和可靠性受到极大挑战。为此提出了一种将先听后说与模拟退火相结合（Listen Before Talk combined with Simulated Annealing，LBT-SA）的LoRa信道接入方法。该方法通过在设备发送之前先监听信道，降低信道被同时接入的概率，并以成功传输所需退避时间为初始值，搜索更小的退避时间。仿真结果表明，LBT-SA和基于二元指数退避算法的先听后说（Listen Before Talk，LBT）方法在包成功传输率方面保持了高度的一致，并且LBT-SA在周期传输过程中逐渐减少了不必要的退避时间，从而减少了时延。在多达10 000个终端接入单个网关的场景中，该算法的平均退避时间至少降低了16.38%。     

基于虚拟现实的复杂场景加载优化算法

目前大规模场景模型生成的需求量日益增加, 现提出了一种基于区域的自动 LOD (Levels Of Details)构建算法. 该算法基于动态网格简化算法, 在游戏设计制作的过程中, 游戏开发人员会经常需要对美工部门人员提供的模型进行优化. 为了可以使模型的面数得到简化, 并且不改变模型的外观. 当今流行的 LOD技术非常擅于处理这种情况, 判断模型与摄像机的距离如果超过一定范围之后, 自动调取不同层次的模型, 当模型距离摄像机很远的情况下使用面数低的模型替换高模, 这样可以提高帧率并且降低摄像机前的三角面以及顶点数从而减少渲染压力. 一般模型的简化分为静态和动态模型的简化.大部分情况下, 程序员会让美工部门提供几套不同面数的模型或者通过模型简化工具对高模进行减面并存成多个Mesh, 并在程序运行的时候, 根据模型与摄像机的距离远近动态的替换Mesh. 这是一种静态的方法.这里将尝试使用一种动态的网格简化和LOD技术相结合的方法. 这种新型算法的大大的简化了操作流程, 美术人员只需要提供一个模型, 程序员可以使用这种方法生成量级不同的低模, 根据摄像机与模型的远近自动的调取不同精度的模型.     

Relevance- and interface-driven clustering for visual information retrieval

Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like $K$-means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in $K$-means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to $K$-means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than $K$-means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives.     

红外菲涅尔透镜的注射超声辅助成型优化

为了提升聚合物红外菲涅尔透镜的光学性能,以其表面微沟槽的成型质量为目标,提出了一种高效的注射超声辅助成型方法,并对工艺参数进行了综合质量优化。首先分析了超声振动对聚合物的加热和加压效应,设计了一套一模两腔的对比试验模具;接着以红外菲涅尔透镜的调制传递函数MTF和齿形平均高度h为优化质量目标,设计了四步骤的多目标优化流程,通过试验设计、基于BP神经网络的质量目标与注射工艺参数关系建模、基于NSGA-Ⅱ的多目标优化和试验验证进行工艺参数的综合优化。实验结果表明:该多目标优化流程具有很高的精度,MTF和h的平均预测误差MPE分别为4.16%和3.32%;注射超声辅助成型的菲涅尔透镜微沟槽具有更高的复制质量,其齿沟槽平均高度h增加了15.6%,且h值的波动量随着h值的增大而增大,MTF值受齿高h均匀性的影响大于齿高h对其的影响。     

工程建设标准客观优先度评价研究

在工程建设标准的制定和修订过程中，如何科学地确定编制顺序一直是困扰标准管理部门的难题，采用传统方式“按需制标”，具有盲目性、主观性，容易造成标准在制定和修订过程中的互相重复、滞后与矛盾。为了保证标准制定和修订工作的协调性，指导标准体系中各标准的制修订顺序，引入复杂网络拓扑结构，将同一标准类型下的标准构成功能团，根据相互之间的关系形成复杂网络，采用剥落算法对其网络节点重要性排序，进而确定标准制修订的优先度。通过对建筑给水排水工程规范标准修订的实证分析，总结工程建设标准的网络拓扑优先度评价的算法模型，实现制定和修订顺序的自动计算，从而更加科学地指导标准的制定和修订工作     

Supply chain network design under the risk of uncertain disruptions

Facility disruptions in the supply chain often lead to catastrophic consequences, although they occur rarely. The low frequency and non-repeatability of disruptive events also make it impossible to estimate the disruption probability accurately. Therefore, we construct an uncertain programming model to design the three-echelon supply chain network with the disruption risk, in which disruptions are considered as uncertain events. Under the constraint of satisfying customer demands, the model optimises the selection of retailers with uncertain disruptions and the assignment of customers and retailers, in order to minimise the expected total cost of network design. In addition, we simplify the proposed model by analysing its properties and further linearise the simplified model. A Lagrangian relaxation algorithm for the linearised model and a genetic algorithm for the simplified model are developed to solve medium-scale problems and large-scale problems, respectively. Finally, we illustrate the effectiveness of proposed models and algorithms through several numerical examples.